On the limiting distribution of the metric dimension for random forests
نویسندگان
چکیده
The metric dimension of a graph G is the minimum size of a subset S of vertices of G such that all other vertices are uniquely determined by their distances to the vertices in S. In this paper we investigate the metric dimension for two different models of random forests, in each case obtaining normal limit distributions for this parameter.
منابع مشابه
Laminar Flame Speed Prediction in Lean Mixture of Aluminum Dust Clouds by Considering the Effect of Random Distribution of Particles in Two-dimension
In the present study, the effect of random distribution of reactants and products on laminar, 2D and steady-state flame propagation in aluminium particles has been investigated. The equations are solved only for lean mixture. The flame structure is assumed to consist of a preheat zone, a reaction zone and a post flame zone. It is presumed that in the preheat zone particles are heated an...
متن کاملRandom forests algorithm in podiform chromite prospectivity mapping in Dolatabad area, SE Iran
The Dolatabad area located in SE Iran is a well-endowed terrain owning several chromite mineralized zones. These chromite ore bodies are all hosted in a colored mélange complex zone comprising harzburgite, dunite, and pyroxenite. These deposits are irregular in shape, and are distributed as small lenses along colored mélange zones. The area has a great potential for discovering further chromite...
متن کاملThe Topology of Scaling Limits of Positive Genus Random Quadrangulations
We discuss scaling limits of large bipartite quadrangulations of positive genus. For a given g, we consider, for every n ≥ 1, a random quadrangulation qn uniformly distributed over the set of all rooted bipartite quadrangulations of genus g with n faces. We view it as a metric space by endowing its set of vertices with the graph distance. As n tends to infinity, this metric space, with distance...
متن کاملScaling Limit of Random Planar Quadrangulations with a Boundary
We discuss the scaling limit of large planar quadrangulations with a boundary whose length is of order the square root of the number of faces. We consider a sequence (σn) of integers such that σn/ √ 2n tends to some σ ∈ [0,∞]. For every n ≥ 1, we call qn a random map uniformly distributed over the set of all rooted planar quadrangulations with a boundary having n faces and 2σn half-edges on the...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 49 شماره
صفحات -
تاریخ انتشار 2015